Zot-binary: a New Numbering System with an Application on Big-integer Multiplication

نویسندگان

  • SHAHRAM JAHANI
  • AZMAN SAMSUDIN
چکیده

In this paper we present a new numbering system with an efficient application on Big-Integer multiplication. The paper starts with an introduction to a new redundant positional numbering system known as “Big-Digit Numbering System” (BDNS). With BDNS, a new non-redundant positional numbering system known as ZOT-Binary is proposed. ZOT-Binary has a low Hamming weight with an average of 23.8% nonzero symbols, and therefore is highly suitable for Big-Integer calculation, especially for BigInteger multiplication. To harvest such benefit from the ZOT-Binary representation, a new Big-Integer multiplication algorithm, ZOT-CM, which is based on the Classical multiplication algorithm, is proposed. Our result shows that when compared with the Classical multiplication algorithm, ZOT-CM is about 12 times faster for multiplying 128 bits numbers and at least 16 times faster for multiplying numbers that are bigger than 32,000 bits long. Our result also shows that ZOT-CM is about 20 to 3 times faster than Karatsuba multiplication algorithm, for multiplying numbers that are ranging from 128 bits to 32,000 bits long. From the findings, it is clear that ZOT-CM is a valuable addition to Big-Integer multiplication algorithm, and it is also believed that ZOT-Binary representation can benefit many other Big-Integer calculations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

Feature Selection in Big Data by Using the enhancement of Mahalanobis–Taguchi System; Case Study, Identifiying Bad Credit clients of a Private Bank of Islamic Republic of Iran

The Mahalanobis-Taguchi System (MTS) is a relatively new collection of methods proposed for diagnosis and forecasting using multivariate data. It consists of two main parts: Part 1, the selection of useful variables in order to reduce the complexity of multi-dimensional systems and part 2, diagnosis and prediction, which are used to predict the abnormal group according to the remaining us...

متن کامل

On the OBDD Complexity of the Most Significant Bit of Integer Multiplication

Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations. Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for boolean functions. Among the many areas of application are verification, model checking, computer-aided design, relational algebra, and symbolic graph algorithms. In...

متن کامل

Bipartite Modular Multiplication

This paper proposes a new fast method for calculating modular multiplication. The calculation is performed using a new representation of residue classes modulo M that enables the splitting of the multiplier into two parts. These two parts are then processed separately, in parallel, potentially doubling the calculation speed. The upper part and the lower part of the multiplier are processed usin...

متن کامل

Elliptic-curve scalar multiplication algorithm using ZOT structure

The computation of P over elliptic curves is the dominant operation. It depends on the representation of the scalar . The binary method is the standard unsigned method that is used to compute the elliptic curve point . Researchers found that it is not the most efficient way for implementing elliptic curve computations. Other recoding methods such as CR, NAF, and MOF were presented in order to e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013